//
// Created by DengLibin on 2018/12/13 0013.
//
/**
 * 队列
 */
#include <iostream>
#include <string>
#include <queue>
using namespace std;

//容器queue:队列
void myQueue()
{
    queue<int> q;
    //入队
    for (int i = 0; i < 10; i++)
    {
        q.push(i);
    }
    cout << "队列大小:" << q.size() << endl;
    //遍历(先进先出)
    while (!(q.empty()))
    {
        cout << q.front() << ",";
        q.pop();//移除队首元素
    }
}
int main25()
{
    myQueue();
    return 0;
}